package com.singzi.leetcode.N300;

import java.util.LinkedList;
import java.util.Queue;

public class T0207 {
}
class Solution0207 {
    public boolean canFinish(int numCourses, int[][] prerequisites) {
        int [][]matrix = new int[numCourses][numCourses];

        for(int[] nums:prerequisites){
            matrix[nums[0]][nums[1]] = 1;
        }
        Queue<Integer> queue = new LinkedList<>();

        return true;

    }
}